On (\delta, p)-continuous functions and (\delta, p)-closed graphs
نویسندگان
چکیده
منابع مشابه
Delta degrees of freedom in antisymmetrized molecular dynamics and (p,p') reactions in the Delta region.
Delta degrees of freedom are introduced into antisymmetrized molecular dynamics (AMD). This is done by increasing the number of basic states in the AMD wave function, introducing a Skyrme-type delta-nucleon potential, and including NN ↔ N∆ reactions in the collision description. As a test of the delta dynamics, the extended AMD is applied to (p,p′) recations at Elab = 800 MeV for a 12C target. ...
متن کاملOn Regular Generalized $delta$-closed Sets in Topological Spaces
In this paper a new class of sets called regular generalized $delta$-closed set (briefly rg$delta$-closed set)is introduced and its properties are studied. Several examples are provided to illustrate the behaviour of these new class of sets.
متن کاملAccurate stability p delta-sigma (∆-Σ
Present approaches for predict of Delta-Sigma (Δ-Σ) modulators are mo DC inputs. This poses limitations as pract of Δ-Σ modulators involve a wide range than DC such as speech, audio and multip the case for synthetically generated spee any other signal, through the appropriat multiple sinusoids. In this paper, a qua that accurately predicts stability of s higher-order Δ-Σ modulators for multi gi...
متن کاملThe p-median and p-center Problems on Bipartite Graphs
Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...
متن کامل(Delta-k)-critical graphs
Every graphG of maximum degree is ( +1)-colourable and a classical theorem of Brooks states that G is not -colourable iff G has a ( + 1)-clique or = 2 and G has an odd cycle. Reed extended Brooks’ Theorem by showing that if (G) 1014 then G is not ( − 1)-colourable iff G contains a -clique. We extend Reed’s characterization of ( − 1)-colourable graphs and characterize ( − 2), ( −3), ( −4) and ( ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Boletim da Sociedade Paranaense de Matemática
سال: 2009
ISSN: 2175-1188,0037-8712
DOI: 10.5269/bspm.v27i2.10205